Weakly Associative Relation Algebras with Polyadic Composition Operations
نویسنده
چکیده
We consider n ary relative products jn on subsets of a re exive and symmetric binary relation and de ne a variety of weakly associative relation algebras with polyadic composi tion operations WA A theorem that any A WA is representable over a re exive and symmetric relation is proved We also show that the equational theory of WA is decidable
منابع مشابه
Introductory Course on Relation Algebras, Finite-dimensional Cylindric Algebras, and Their Interconnections
These are notes for a short course on relation algebras, nite-dimensional cylindric algebras, and their interconnections, delivered at the Conference on Alge-Relation algebras (RA's) are closely linked to cylindric algebras (CA's) and polyadic equality algebras (PEA's), and yet in certain ways they are quite diierent. The links and diierences allow for constructive interaction between these sub...
متن کاملThe Non-symmetric Operad Pre-lie Is Free
Operads are a specific tool for encoding type of algebras. For instance there are operads encoding associative algebras, commutative and associative algebras, Lie algebras, pre-Lie algebras, dendriform algebras, Poisson algebras and so on. A usual way of describing a type of algebras is by giving the generating operations and the relations among them. For instance a Lie algebra L is a vector sp...
متن کاملWeakly associative relation algebras with projections
Built on the foundations laid by Peirce, Schröder and others in the 19th century, the modern development of relation algebras started with the work of Tarski and his colleagues [21, 22]. They showed that relation algebras can capture strong rst-order theories like ZFC, and so their equational theory is undecidable. The less expressive classWA of weakly associative relation algebras were introd...
متن کاملA construction of cylindric and polyadic algebras from atomic relation algebras
Given a simple atomic relation algebra A and a finite n ≥ 3, we construct effectively an atomic n-dimensional polyadic equality-type algebra P such that for any subsignature L of the signature of P that contains the boolean operations and cylindrifications, the L-reduct of P is completely representable if and only if A is completely representable. If A is finite then so is P. It follows that th...
متن کاملAspects of relation algebras
Outline 1. Introduction to relation algebras. Representations. Atom structures. Examples. 2. Using games to build representations. Axiomatising the finite representable relation algebras. 3. 'Rainbow' construction (Hirsch). Monk's theorem that the representable relation algebras are not finitely axiomatisable. 4. Relativised representations. Weakly associative algebras (WA, Maddux). Finite base...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Studia Logica
دوره 66 شماره
صفحات -
تاریخ انتشار 2000